409. Longest Palindrome - LeetCode Solution

class Solution:
    def longestPalindrome(self, s: str) -> int:
        dic = {}
        
        for i in range(len(s)):
            if s[i] in dic:
                dic[s[i]] +=1
            else:
                dic[s[i]] = 1
        
        ans = 0
        c = 0
        for i in dic:
            if dic[i]%2 == 0:
                ans+= dic[i]
            else:
                ans += dic[i] -1
                c = 1
        return ans + c